A Boolean Paradigm in Multi-Valued Logic Synthesis

Optimization algorithms used in binary multi-level logic synthesis, such as network simplification, logic extraction, and resubstitution, have been treated independently and did not share computational procedures. Using multi-valued logic synthesis, some common conceptual and computational cores underlying these algorithms can be identified. We present an overview of a Boolean paradigm in multivalued logic synthesis. The Boolean algorithms are generalizations of the usual ones and can replace these and the traditional algebraic algorithms, offering improved trade-offs between computation speed and optimization quality.